Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Christopher Lynch And NotÉtat de New York

List of bibliographic references

Number of relevant bibliographic references: 19.
Ident.Authors (with country if any)Title
001A56 Siva Anantharaman [France] ; Serdar Erbatur [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification modulo Synchronous Distributivity
002815 Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie]Automatic decidability and combinability
002D71 Siva Anantharaman [France] ; Hai Lin ; Christopher Lynch ; Paliath Narendran ; Michael Rusinowitch [France]Cap Unification: Application to Protocol Security modulo Homomorphic Encryption
004D00 Christopher Lynch [États-Unis] ; Duc-Khanh Tran [France]Automatic Decidability and Combinability Revisited
00AD99 Christopher Lynch [États-Unis] ; Polina Strogova [France]SOUR graphs for efficient completion
00B015 Christopher Lynch ; Christelle ScharffBasic Completion with E-cycle Simplification
00B111 Christopher LynchLocal simplification
00B166 Christopher Lynch ; Polina StrogovaSOUR Graphs for Efficient Completion
00B351 Christopher Lynch [France]Local Simplification
00B454 Christopher Lynch [France]Local simplification
00B685 Christopher Lynch [Belgique] ; Christelle Scharff [France]Basic Completion with E-cycle Simplification
00B962 Christopher LynchOriented equational logic programming is complete
00BC28 Christopher Lynch [France]Oriented Equational Logic Programming is Complete
00BE78 Claude Kirchner ; Christopher Lynch ; Christelle ScharffA Fine-grained Concurrent Completion Procedure
00BE89 Christopher Lynch ; Polina StrogovaPATCH Graphs : An Efficient Data Structure for Completion of Finitely Presented Groups
00C041 Christopher Lynch [France] ; Polina Strogova [France]PATCH Graphs: An efficient data structure for completion of finitely presented groups
00C067 Claude Kirchner [France] ; Christopher Lynch [France] ; Christelle Scharff [France]Fine-grained concurrent completion
00C165 Claude Kirchner [France] ; Christopher Lynch ; Christelle ScharffA Fine-Grained Concurrent Completion Procedure
00DA68 Wayne Snyder [États-Unis] ; Christopher Lynch [États-Unis]Goal directed strategies for paramodulation

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022